Defect of characters of the symmetric group
نویسنده
چکیده
Following the work of B. Külshammer, J. B. Olsson and G. R. Robinson on generalized blocks of the symmetric groups, we give a definition for the l-defect of characters of the symmetric group Sn, where l > 1 is an arbitrary integer. We prove that the l-defect is given by an analogue of the hook-length formula, and use it to prove, when n < l, an l-version of the McKay Conjecture in Sn.
منابع مشابه
Symmetry classes of polynomials associated with the dihedral group
In this paper, we obtain the dimensions of symmetry classes of polynomials associated with the irreducible characters of the dihedral group as a subgroup of the full symmetric group. Then we discuss the existence of o-basis of these classes.
متن کاملCongruences for the Number of Spin Characters of the Double Covers of the Symmetric and Alternating Groups
Let p be an odd prime. The bar partitions with sign and p-bar-core partitions with sign respectively label the spin characters and p-defect zero spin characters of the double cover of the symmetric group, and by restriction, those of the alternating group. The generating functions for these objects have been determined by J. Olsson. We study these functions from an arithmetic perspective, using...
متن کاملCore partitions and block coverings
A number of new results about core partitions have been proved recently. ([2],[3], [9], [12]) For s ∈ N an s-core is by definition an integer partition without hooks of length s. This type of partitions first occurred in modular representation theory of symmetric groups, where s-cores label s-blocks of defect 0 in the case where s is a prime. In the study of relations between blocks for differe...
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کاملAutomorphism Group of a Possible 2-(121, 16, 2) Symmetric Design
Let D be a symmetric 2-(121, 16, 2) design with the automorphism group of Aut(D). In this paper the order of automorphism of prime order of Aut(D) is studied, and some results are obtained about the number of fixed points of these automorphisms. Also we will show that |Aut(D)|=2p 3q 5r 7s 11t 13u, where p, q, r, s, t and u are non-negative integers such that r, s, t, u ? 1. In addition we prese...
متن کامل